A random construction for permutation codes and the covering radius
نویسندگان
چکیده
Weanalyse a probabilistic argument that gives a semi-random construction for a permutation code on n symbols with distance n− s and size (s!(log n)1/2), and a bound on the covering radius for sets of permutations in terms of a certain frequency parameter.
منابع مشابه
Infinity-Norm Permutation Covering Codes from Cyclic Groups
We study covering codes of permutations with the l∞-metric. We provide a general code construction, which uses smaller building-block codes. We study cyclic transitive groups as building blocks, determining their exact covering radius, and showing linear-time algorithms for finding a covering codeword. We also bound the covering radius of relabeled cyclic transitive groups under conjugation. In...
متن کاملThe remoteness of the permutation code of the group $U_{6n}$
Recently, a new parameter of a code, referred to as the remoteness, has been introduced.This parameter can be viewed as a dual to the covering radius. It is exactly determined for the cyclic and dihedral groups. In this paper, we consider the group $U_{6n}$ as a subgroup of $S_{2n+3}$ and obtain its remoteness. We show that the remoteness of the permutation code $U_{6n}$ is $2n+2$. Moreover, ...
متن کاملOn Codes with Given Minimum Distance and Covering Radius
Codes with minimum distance at least d and covering radius at most d− 1 are considered. The minimal cardinality of such codes is investigated. Herewith, their connection to covering problems is applied and a new construction theorem is given. Additionally, a new lower bound for the covering problem is proved. A necessary condition on an existence problem is presented by using a multiple coverin...
متن کاملNew Quaternary Linear Codes with Covering Radius 21
A new quaternary linear code of length 19, codimension 5, and covering radius 2 is found in a computer search using tabu search, a local search heuristic. Starting from this code, which has some useful partitioning properties, di!erent lengthening constructions are applied to get an in"nite family of new, record-breaking quaternary codes of covering radius 2 and odd codimension. An algebraic co...
متن کاملThe multicovering radius problem for some types of discrete structures
The covering radius problem is a question in coding theory concerned with finding the minimum radius r such that, given a code that is a subset of an underlying metric space, balls of radius r over its code words cover the entire metric space. Klapper ([13]) introduced a code parameter, called the multicovering radius, which is a generalization of the covering radius. In this paper, we introduc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Des. Codes Cryptography
دوره 41 شماره
صفحات -
تاریخ انتشار 2006